Representation of Graph Structure Based on I-V Neutrosophic Sets
نویسنده
چکیده
In this research article, we apply the concept of interval-valued neutrosophic sets to graph structures. We present the concept of interval-valued neutrosophic graph structures. We describe certain operations on interval-valued neutrosophic graph structures and elaborate them with appropriate examples. Further, we investigate some relevant properties of these operators. Moreover, we propose some open problems on interval-valued neutrosophic line graph structures.
منابع مشابه
Novel multiple criteria decision making methods based on bipolar neutrosophic sets and bipolar neutrosophic graphs
In this research study, we introduce the concept of bipolar neutrosophic graphs. We present the dominating and independent sets of bipolar neutrosophic graphs. We describe novel multiple criteria decision making methods based on bipolar neutrosophic sets and bipolar neutrosophic graphs. We also develop an algorithm for computing domination in bipolar neutrosophic graphs. Key-words: Bipolar neut...
متن کاملSingle-Valued Neutrosophic Graph Structures
A graph structure is a generalization of undirected graph which is quite useful in studying some structures, including graphs and signed graphs. In this research paper, we apply the idea of single-valued neutrosophic sets to graph structure, and explore some interesting properties of single-valued neutrosophic graph structure. We also discuss the concept of φ-complement of single-valued neutros...
متن کاملShortest Path Problem under Bipolar Neutrosphic Setting
This main purpose of this paper is to develop an algorithm to find the shortest path on a network in which the weights of the edges are represented by bipolar neutrosophic numbers. Finally, a numerical example has been provided for illustrating the proposed approach. Introduction Smarandache [1, 2] introduced neutrosophic set and neutrosophic logic by considering the nonstandard analysis. The c...
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کاملRepresentation of Graphs using Intuitionistic Neutrosophic Soft Sets
The concept of intuitionistic neutrosophic soft sets can be utilized as a mathematical tool to deal with imprecise and unspecified information. In this paper, we apply the concept of intuitionistic neutrosophic soft sets to graphs. We introduce the concepts of intuitionistic neutrosophic soft graphs, and present applications of intuitionistic neutrosophic soft graphs in a multiple-attribute dec...
متن کامل